Anti-Ramsey properties of random graphs
نویسندگان
چکیده
We call a coloring of the edge set of a graph G a b-bounded coloring if no color is used more than b times. We say that a subset of the edges of G is rainbow if each edge is of a different color. A graph has property A(b, H) if every b-bounded coloring of its edges has a rainbow copy of H. We estimate the threshold for the random graph Gn,p to have property A(b, H).
منابع مشابه
All Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملRamsey Graphs Induce Subgraphs of Many Different Sizes
A graph on n vertices is said to be C-Ramsey if every clique or independent set of the graph has size at most C log n. The only known constructions of Ramsey graphs are probabilistic in nature, and it is generally believed that such graphs possess many of the same properties as dense random graphs. Here, we demonstrate one such property: for any fixed C > 0, every C-Ramsey graph on n vertices i...
متن کاملThe Size-ramsey Number
The size-Ramsey number of a graph G is the smallest number of edges in a graph Γ with the Ramsey property for G, that is, with the property that any colouring of the edges of Γ with two colours (say) contains a monochromatic copy of G. The study of size-Ramsey numbers was proposed by Erdős, Faudree, Rousseau, and Schelp in 1978, when they investigated the size-Ramsey number of certain classes o...
متن کاملThreshold functions for asymmetric Ramsey properties involving cycles
We consider the binomial random graphGn,p and determine a sharp threshold function for the edge-Ramsey property Gn,p → (C1 , . . . , Cr ) for all `1, . . . , `r, where C denotes the cycle of length `. As deterministic consequences of our results, we prove the existence of sparse graphs having the above Ramsey property as well as the existence of infinitely many critical graphs with respect to t...
متن کاملUpper bounds on probability thresholds for asymmetric Ramsey properties
Given two graphs G and H, we investigate for which functions p = p(n) the random graph Gn,p (the binomial random graph on n vertices with edge probability p) satisfies with probability 1 − o(1) that every red-blue-coloring of its edges contains a red copy of G or a blue copy of H. We prove a general upper bound on the threshold for this property under the assumption that the denser of the two g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 100 شماره
صفحات -
تاریخ انتشار 2010